Hamming weights in irreducible cyclic codes
نویسندگان
چکیده
منابع مشابه
Hamming weights in irreducible cyclic codes
The objectives of this paper are to survey and extend earlier results on the weight distributions of irreducible cyclic codes, present a divisibility theorem and develop bounds on the weights in irreducible cyclic codes. © 2012 Elsevier B.V. All rights reserved.
متن کاملRelative generalized Hamming weights of cyclic codes
Abstract. Relative generalized Hamming weights (RGHWs) of a linear code respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the code. They can be used to express the information leakage of the secret when some keepers of shares are corrupted. Cyclic codes are an interesting type of linear codes and have wide applications in communication and stor...
متن کاملOn The Weights of Irreducible Cyclic Codes
The paper is devoted to the study of the weight distribution of irreducible cyclic codes. We start from the interpretation due to McEliece of these weights by means of Gauss sums. Firstly, a p-adic analysis using Stickelberger congruences and Gross-Koblitz formula enable us to improve the divisibility theorem of McEliece by giving results on the multiplicity of the weights. Secondly, in connect...
متن کاملOn the Weights of Binary Irreducible Cyclic Codes
This paper is devoted to the study of the weights of binary irreducible cyclic codes. We start from McEliece’s interpretation of these weights by means of Gauss sums. Firstly, a dyadic analysis, using the Stickelberger congruences and the Gross-Koblitz formula, enables us to improve McEliece’s divisibility theorem by giving results on the multiplicity of the weights. Secondly, in connection wit...
متن کاملGeneralized Hamming weights for linear codes
Error control codes are widely used to increase the reliability of transmission of information over various forms of communications channels. The Hamming weight of a codeword is the number of nonzero entries in the word; the weights of the words in a linear code determine the error-correcting capacity of the code. The rth generalized Hamming weight for a linear code C, denoted by dr(C), is the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.11.009